Least-Squares Halftoning via Human Vision System and Markov Gradient Descent (LS-MGD): Algorithm and Analysis
نویسنده
چکیده
Halftoning is the core algorithm governing most digital printing or imaging devices, by which images of continuous tones are converted to ensembles of discrete or quantum dots. It is through the human vision system (HVS) that such fields of quantum dots can be perceived almost identical to the original continuous images. In the current work, we propose a least-square based halftoning model with a substantial contribution from the HVS model, and design a robust computational algorithm based on Markov random walks. Furthermore, we discuss and quantify the important role of spatial smoothing by the HVS, and rigorously prove the gradient-descent property of the Markov-stochastic algorithm. Computational results on typical test images further confirm the performance of the new approach. The proposed algorithm and its mathematical analysis are generically applicable to similar discrete or nonlinear programming problems.
منابع مشابه
LEAST-SQUARE HALFTONING VIA HUMAN VISION SYSTEM AND MARKOV GRADIENT DESCENT (LS-MGD): ALGORITHM AND ANALYSIS By
Halftoning is the core algorithm governing most digital printing or imaging devices, by which images of continuous tones are converted to ensembles of discrete or quantum dots. It is through the human vision system (HVS) that such fields of quantum dots can be perceived almost identical to the original continuous images. In the current work, we propose a leastsquare based halftoning model with ...
متن کاملLeast-square Halftoning via Human Vision System and Markov Gradient Descent (ls-mgd): Algorithm and Analysis
Halftoning is the core algorithm governing most digital printing or imaging devices, by which images of continuous tones are converted to ensembles of discrete or quantum dots. It is through the human vision system (HVS) that such fields of quantum dots can be perceived almost identical to the original continuous images. In the current work, we propose a least-square based halftoning model with...
متن کاملMultiple Parameter Selection for LS-SVM Using Smooth Leave-One-Out Error
In least squares support vector (LS-SVM), the key challenge lies in the selection of free parameters such as kernel parameters and tradeoff parameter. However, when a large number of free parameters are involved in LS-SVM, the commonly used grid search method for model selection is intractable. In this paper, SLOO-MPS is proposed for tuning multiple parameters for LS-SVM to overcome this proble...
متن کاملA generalized learning paradigm exploiting the structure of feedforward neural networks
In this paper a general class of fast learning algorithms for feedforward neural networks is introduced and described. The approach exploits the separability of each layer into linear and nonlinear blocks and consists of two steps. The first step is the descent of the error functional in the space of the outputs of the linear blocks (descent in the neuron space), which can be performed using an...
متن کاملGradient Projection Iterative Sketch for Large-Scale Constrained Least-Squares
We propose a randomized first order optimization algorithm Gradient Projection Iterative Sketch (GPIS) and an accelerated variant for efficiently solving large scale constrained Least Squares (LS). We provide the first theoretical convergence analysis for both algorithms. An efficient implementation using a tailored linesearch scheme is also proposed. We demonstrate our methods’ computational e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 51 شماره
صفحات -
تاریخ انتشار 2009